6d Classiication of Pattern Matching Problems 1
نویسندگان
چکیده
We present our uni ed view to pattern matching problems and their solutions. We classify pattern matching problems by using six criteria and therefore we can locate them into six-dimensional space. We also show basic model of nondeterministic nite automaton that can be used for constructing models for all pattern matching problems.
منابع مشابه
Subset Selection Using a Genetic Algorithm
Practical pattern classiication and knowledge discovery problems require selection of a subset of attributes or features (from a much larger set) to represent the patterns to be classiied. This is due to the fact that the performance of the classiier (usually induced by some learning algorithm) and the cost of classiication are sensitive to the choice of the features used to construct the class...
متن کاملConstructive Neural Network Learning Algorithms for Pattern Classiication
Constructive learning algorithms ooer an attractive approach for the incremental construction of near-minimal neural network architectures for pattern classiication. They help overcome the need for ad hoc and often inappropriate choices of network topology in the use of algorithms that search for suitable weights in a priori xed network architectures. Several such algorithms have been proposed ...
متن کاملPattern Extraction for Time Series Classi
In this paper, we propose some new tools to allow machine learning classiiers to cope with time series data. We rst argue that many time-series classiication problems can be solved by detecting and combining local properties or patterns in time series. Then, a technique is proposed to nd patterns which are useful for classiication. These patterns are combined to build interpretable classiicatio...
متن کاملInput Space
We have studied the application of diierent classiication algorithms in the analysis of simulated high energy physics data. Whereas Neural Network algorithms have become a standard tool for data analysis, the performance of other classiiers such as Support Vector Machines has not yet been tested in this environment. We chose two diierent problems to compare the performance of a Support Vector M...
متن کاملOn The Role of Pattern Matching In
In this paper, the role of pattern matching information theory is motivated and discussed. We describe the relationship between a pattern's recurrence time and its probability under the data generating stochastic source. We motivate how this relationship has led to great advances in universal data-compression. We then describe non-asymptotic uniform bounds on the performance of data compression...
متن کامل